Dynamics of Systems with Low Complexity
نویسندگان
چکیده
منابع مشابه
ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملA Low Complexity Forward Error Correction for PAPR reduction in OFDM Systems
In this paper, a Peak to Average Power Ratio (PAPR) reduction technique in Orthogonal Frequency Division Multiplexing (OFDM) systems is proposed. This technique uses error correction capability of channel coding to reduce the PAPR.The coded bits at the input of OFDM modulator are separated into two groups of the Most Significant Bits (MSB) and the LeastSignificant Bits (LSB). The bits are mappe...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولSystems Dynamics, Sustainability and Construction Complexity
This paper analyzes the work of Forrester and Sterman (J. W. Forrester Chair at MIT) to establish that these reliable studies address sustainability challenges such as emissions generation. However, these studies do not fully address whether the proposed required reductions in ecological impact can be realized to tame the observed growth rates. The Systems Dynamics models are based on algorithm...
متن کاملLow complexity techniques for embedded ASR systems
This paper deals with the problem of reducing the computational complexity of ASR algorithms for embedded systems. Particularly, three methods for simplifying the computation of state observation likelihoods of continuous density based HMMs are proposed. Feature component masking, variable-rate partial likelihood update and density pruning all result in significant savings in the decoding compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notices of the American Mathematical Society
سال: 2019
ISSN: 0002-9920,1088-9477
DOI: 10.1090/noti1779